Fourier-domain dedispersion
نویسندگان
چکیده
We present and implement the concept of Fourier-domain dedispersion (FDD) algorithm, a brute-force incoherent algorithm. This algorithm corrects frequency-dependent dispersion delays in arrival time radio emission from sources such as pulsars fast bursts. Where traditional time-domain algorithms correct using shifts, FDD performs these shifts by applying phase rotations to Fourier-transformed time-series data. Incoherent many trial measures (DMs) is compute, memory-bandwidth I/O intensive have been implemented on Graphics Processing Units (GPUs) achieve high computational performance. However, low arithmetic intensity are therefore often limited. The avoids this limitation compute limited, providing path exploit potential current upcoming generations GPUs. an extension DEDISP software. compare performance energy-to-completion implementation NVIDIA Titan RTX GPU against standard well optimized version DEDISP. already provides factor 1.5 2 speedup at only 66% energy utilization compared original find that outperforms another 20% 5% when large number DMs (>=512) required. additional improvements for FFT-based periodicity surveys pulsars, FFT back domain can be omitted. expect gain will further improve future.
منابع مشابه
The fractional Fourier domain decomposition
We introduce the fractional Fourier domain decomposition. A procedure called pruning, analogous to truncation of the singular-value decomposition, underlies a number of potential applications, among which we discuss fast implementation of space-variant linear systems. ( 1999 Published by Elsevier Science B.V. All rights reserved.
متن کاملVariable Elimination in Fourier Domain
Probabilistic inference is a key computational challenge in statistical machine learning and artificial intelligence. The ability to represent complex high dimensional probability distributions in a compact form is the most important insight in the field of graphical models. In this paper, we explore a novel way to exploit compact representations of highdimensional probability distributions in ...
متن کاملPolynomial Fourier domain as a domain of signal sparsity
— A compressive sensing (CS) reconstruction method for polynomial phase signals is proposed in this paper. It relies on the Polynomial Fourier transform, which is used to establish a relationship between the observation and sparsity domain. Polynomial phase signals are not sparse in commonly used domains such as Fourier or wavelet domain. Therefore, for polynomial phase signals standard CS algo...
متن کاملPerformance of fourier domain vs. time domain optical coherence tomography.
In this article we present a detailed discussion of noise sources in Fourier Domain Optical Coherence Tomography (FDOCT) setups. The performance of FDOCT with charge coupled device (CCD) cameras is compared to current standard time domain OCT systems. We describe how to measure sensitivity in the case of FDOCT and confirm the theoretically obtained values. It is shown that FDOCT systems have a ...
متن کاملClustering Rankings in the Fourier Domain
It is the purpose of this paper to introduce a novel approach to clustering rank data on a set of possibly large cardinality n ∈ N∗, relying upon Fourier representation of functions defined on the symmetric group Sn. In the present setup, covering a wide variety of practical situations, rank data are viewed as distributions on Sn. Cluster analysis aims at segmenting data into homogeneous subgro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Astronomy and Astrophysics
سال: 2022
ISSN: ['0004-6361', '1432-0746']
DOI: https://doi.org/10.1051/0004-6361/202142099